Comparison of LZ77-type Parsings

We investigate the relations between different variants of the LZ77 parsing existing in the literature. All of them are defined as greedily constructed parsings encoding each phrase by reference to a string occurring earlier in the input. They differ by the phrase encodings: encoded by pairs (length + position of an earlier occurrence) or by triples (length + position of an earlier occurrence + the letter following the earlier occurring part); and they differ by allowing or not allowing overlaps between the phrase and its earlier occurrence. For a given string of length n over an alphabet of size σ, denote the numbers of phrases in the parsings allowing (resp., not allowing) overlaps by z (resp., ẑ), for “pairs”, and by z3 (resp., ẑ3), for “triples”. We prove the following bounds and provide series of examples showing that these bounds are tight: • z ≤ ẑ ≤ z · O(log n z log σ z ) and z3 ≤ ẑ3 ≤ z3 ·O(log n z3 logσ z3 ); • 1 2 ẑ < ẑ3 ≤ ẑ and 1 2z < z3 ≤ z.